Random Walk on Uppertriangular Matrices Mixes
نویسنده
چکیده
We present an upper bound O(n 2) for the mixing time of a simple random walk on upper triangular matrices. We show that this bound is sharp up to a constant, and nd tight bounds on the eigenvalue gap. We conclude by applying our results to indicate that the asymmetric exclusion process on a circle indeed mixes more rapidly than the corresponding symmetric process.
منابع مشابه
Random walk on upper triangular matrices mixes rapidly
We present an upper bound O(n2) for the mixing time of a simple random walk on upper triangular matrices. We show that this bound is sharp up to a constant, and find tight bounds on the eigenvalue gap. We conclude by applying our results to indicate that the asymmetric exclusion process on a circle indeed mixes more rapidly than the corresponding symmetric process.
متن کاملTotal Variation Bound for Kac’s Random Walk
We show that the classical Kac’s random walk on S starting from the point mass at e1 mixes in O(n log n) steps in total variation distance. This improves a previous bound by Diaconis and Saloff-Coste of O(n).
متن کاملRandom Walk Approach to Regret Minimization
We propose a computationally efficient random walk on a convex body which rapidly mixes to a time-varying Gibbs distribution. In the setting of online convex optimization and repeated games, the algorithm yields low regret and presents a novel efficient method for implementing mixture forecasting strategies.
متن کاملJohn's Walk
We present an affine-invariant random walk for drawing uniform random samples from a convex body K Ă Rn for which the maximum volume inscribed ellipsoid, known as John’s ellipsoid, may be computed. We consider a polytope P “ x P Rn ˇ̌ Ax ď 1 ( where A P R as a special case. Our algorithm makes steps using uniform sampling from the John’s ellipsoid of the symmetrization of K at the current point....
متن کاملRandom Walks on Finite Groups with Few Random Generators
Let G be a finite group. Choose a set S of size k uniformly from G and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of S given k = 2 a log2 |G|, a > 1, this walk mixes in under m = 2a log a a−1 log |G| steps. A similar result was obtained earlier by Alon and Roichman (see [AR]), Dou and Hildebrand (see [DH]) using a different techniques. We ...
متن کامل